-
1 provable sentence
Большой англо-русский и русско-английский словарь > provable sentence
-
2 provable sentence
Математика: доказуемое предложение -
3 provable sentence
-
4 provable sentence
The New English-Russian Dictionary of Radio-electronics > provable sentence
-
5 provable sentence
-
6 provable sentence
Англо-русский словарь по исследованиям и ноу-хау > provable sentence
-
7 logically provable sentence
Англо-русский словарь по исследованиям и ноу-хау > logically provable sentence
-
8 provable
матем. доказуемый arithmetically provable formula ≈ арифметически доказуемая формула formally provable theorem ≈ лог. формально доказуемая теорема geometrically provable formula ≈ геометрически доказуемая формула - arithmetically provable - formally provable - geometrically provable - intuitionistically provable - provable definability - provable equation - provable formula - provable sentence - provable sequent - provable statement доказуемый provable доказуемыйБольшой англо-русский и русско-английский словарь > provable
-
9 sentence
1) высказывание; предложение; фраза2) суждение•- almost false sentence - almost true sentence - analytically expressible sentence - arithmetically expressible sentence - logically universal sentence - logically valid sentence -
10 sentence
1) вчт предложениеа) высказывание; фраза; синтаксическая конструкция2) приговор•- analytically expressible sentence
- atomic sentence
- closed sentence
- composite sentence
- conditional sentence
- consistent sentence
- contradictory sentence
- declarative sentence
- equisignificant sentences
- equivalent sentences
- false sentence
- grammatical sentence
- Horn sentence
- inconsistent sentence
- inverse sentence
- mathematical sentence
- matrix sentence
- open sentence
- provable sentence
- quantifier-free sentence
- satisfiable sentence
- topic sentence
- true sentence
- unambiguous sentence
- Usenet death sentence -
11 sentence
1) вчт. предложениеа) высказывание; фраза; синтаксическая конструкция2) приговор•- analytically expressible sentence
- atomic sentence
- closed sentence
- composite sentence
- conditional sentence
- consistent sentence
- contradictory sentence
- declarative sentence
- equisignificant sentences
- equivalent sentences
- false sentence
- grammatical sentence
- Horn sentence
- inconsistent sentence
- inverse sentence
- mathematical sentence
- matrix sentence
- open sentence
- provable sentence
- quantifier-free sentence
- satisfiable sentence
- topic sentence
- true sentence
- unambiguous sentence
- Usenet death sentenceThe New English-Russian Dictionary of Radio-electronics > sentence
-
12 доказуемое высказывание
provable statement, provable sentenceРусско-английский словарь по электронике > доказуемое высказывание
-
13 доказуемое высказывание
provable sentence, provable statementРусско-английский словарь по радиоэлектронике > доказуемое высказывание
-
14 доказуемое предложение
provable sentence мат.Русско-английский научно-технический словарь Масловского > доказуемое предложение
-
15 доказуемое предложение
Большой англо-русский и русско-английский словарь > доказуемое предложение
-
16 доказуемое предложение
Mathematics: provable sentenceУниверсальный русско-английский словарь > доказуемое предложение
-
17 arithmetically
арифметически arithmetically consistent data ≈ арифметически непротиворечивые данные arithmetically definable set ≈ арифметически определимое множество arithmetically defined subgroup ≈ арифметически определенная подгруппа arithmetically equivalent degree ≈ арифметически эквивалентная степень arithmetically expressible sentence ≈ арифметически выразимое высказывание arithmetically extensible function ≈ арифметически продолжаемая функция arithmetically normal variety ≈ арифметически нормальное многообразие arithmetically provable formula ≈ арифметически доказуемая формула arithmetically valid formula ≈ арифметически общезначимая формула completely arithmetically productive set ≈ вполне арифметически продуктивное множество - arithmetically connected - arithmetically definable - arithmetically equivalent - arithmetically extensible - arithmetically provable - arithmetically validарифметическиБольшой англо-русский и русско-английский словарь > arithmetically
См. также в других словарях:
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… … Wikipedia
Proof sketch for Gödel's first incompleteness theorem — This article gives a sketch of a proof of Gödel s first incompleteness theorem. This theorem applies to any formal theory that satisfies certain technical hypotheses which are discussed as needed during the sketch. We will assume for the… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Original proof of Gödel's completeness theorem — The proof of Gödel s completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a rewritten version of the dissertation, published as an article in 1930) is not easy to read today; it uses concepts and formalism that are… … Wikipedia
Rosser's trick — For the theorem about the sparseness of prime numbers, see Rosser s theorem. For a general introduction to the incompleteness theorems, see Gödel s incompleteness theorems. In mathematical logic, Rosser s trick is a method for proving Gödel s… … Wikipedia
Soundness — In mathematical logic, a logical system has the soundness property if and only if its inference rules prove only formulas that are valid with respect to its semantics. In most cases, this comes down to its rules having the property of preserving… … Wikipedia
Curry's paradox — For Paul Curry s optical illusion and dissection puzzle, see Missing square puzzle. Curry s paradox is a paradox that occurs in naive set theory or naive logics, and allows the derivation of an arbitrary sentence from a self referring sentence… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia